Integration of indifference-zone with multi-objective computing budget allocation

In this paper, we consider how to address the issues of having designs with close performance in the multi-objective ranking and selection (MORS) problem. To resolve this issue we propose integrating the indifference-zone (IZ) concept into the multi-objective computing budget allocation (MOCBA) framework. In particular, when IZ is introduced into the MOCBA framework, we address how to determine the probability of non-dominance, how to define the Pareto set, and how to derive allocation rules for the simulation replications. Empirical results show that the MOCBA framework with IZ can significantly save simulation budget when designs to be compared have close performance.     

二供应商经济批量问题的多项式时间算法

为了从采购费用结构不同的供应商中找到最佳补货策略,考虑一个零售商从两个供应商补货的二供应商经济批量问题.零售商在两个供应商处的采购费用结构分别为复合安装费用和全单位数量折扣费用结构.通过对问题结构性质的分析论证,将问题的可行解转化为一个有向网络,降低问题求解的计算复杂性.综合动态规划和Dijkstra最短路算法证明了该问题是多项式时间可解的.     

组织系统中领导绩效因素动态分析

组织系统的领导绩效主要取决于行为绩效、成本绩效和组织绩效.在行为绩效保持平稳的状态下,结合投入成本和组织绩效的变化情况,构建连续时间的领导绩效动态模型,以最优领导绩效为目标,应用边际分析方法和最优控制方法,定量分析组织系统的主控因素对于领导绩效的影响度.在组织系统中寻求改进和完善领导绩效的最优路径.     

基于MAS协作机制的动态计算资源调度模型

针对网格环境的自治性、动态性、分布性和异构性等特征.提出基于多智能体系统(Mutil Agent System,MAS)博弈协作的资源动态分配和任务调度模型,建立了能够反映供求关系的网格资源调度模型和任务求解算法,证明了资源分配博弈中Nash均衡点的存在性、唯一性和Nash均衡解,该方法能够利用消费者agent的学习和协商能力,考虑和引入消费者的心理行为,使得消费者的资源申请和任务调度具有较高的合理性和有效性.实验结果表明,资源调度算法不但可以有效减少不必要的延迟,而且在响应时间的平滑性、吞吐率及资源利用率方面比传统算法要好,从而使得整个资源的供需合理、负载均衡.     

具有销售成本的小额信贷模型

首先剖析了我国小额贷款实践的现状和存在的问题,通过理论和数学模型分析,指出信贷约束本身并不是贫困产生和持续的充分条件.由于农户存在产品销售成本带来的销售规模效应给农户的贫困的影响及其对农村小额信贷项目的影响,过低的贷款额度可能会使得小额贷款项目对农户失去吸引力,造成小额贷款需求萎缩.因此,适当扩大小额贷款的额度限制,有利于农户更加积极地参与到小额贷款项目中,通过正当经营,增加收入,从而提高生活水平.     

改进的最小费用理论在盲竖井选址中的应用

在网络的任意点求解绝对中心等特殊点是网络流研究的一个难点.在目前最小费用理论的基础上引入平面几何理论,把网络等效于几何图形,建立了数学模型.通过求解,得出了网络间的最佳连接点,从而确定出盲竖井的位置.最后以云南锡业集团个旧东区两个生产平台之间的连接为一算例,得出了理想的结果,验证了该方法的有效可行性.     

An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP)

The multi-objective resource allocation problem (MORAP) addresses the important issue which seeks to find the expected objectives by allocating the limited amount of resource to various activates. Resources may be manpower, assets, raw material or anything else in limited supply which can be used to accomplish the goals. The goals may be objectives (i.e., minimizing costs, or maximizing efficiency) usually driven by specific future needs. In this paper, in order to obtain a set of Pareto solution efficiently, we proposed a modified version of ant colony optimization (ACO), in this algorithm we try to increase the efficiency of algorithm by increasing the learning of ants. Effectiveness and efficiency of proposed algorithm was validated by comparing the result of ACO with hybrid genetic algorithm (hGA) which was applied to MORAP later.     

A note on coalitional manipulation and centralized inventory management

In this note we deal with inventory games as defined in Meca et al. (Math. Methods Oper. Res. 57:483–491, 2003). In that context we introduce the property of immunity to coalitional manipulation, and demonstrate that the SOC-rule (Share the Ordering Cost) is the unique allocation rule for inventory games which satisfies this property. The authors acknowledge the financial support of Ministerio de Educación y Ciencia, FEDER and Xunta de Galicia through projects SEJ2005-07637-C02-02 and PGIDIT06PXIC207038PN.     

A hybrid two-stage transportation and batch scheduling problem

We study the coordinated scheduling problem of hybrid batch production on a single batching machine and two-stage transportation connecting the production, where there is a crane available in the first-stage transportation that transports jobs from the warehouse to the machine and there is a vehicle available in the second-stage transportation to deliver jobs from the machine to the customer. As the job to be carried out is big and heavy in the steel industry, it is reasonable assumed that both the crane and the vehicle have unit capacity. The batching machine processes a batch of jobs simultaneously. Each batch occur a setup cost. The objective is to minimize the sum of the makespan and the total setup cost. We prove that this problem is strongly NP-hard. A polynomial time algorithm is proposed for a case where the job transportation times are identical on the crane or the vehicle. An efficient heuristic algorithm for the general problem is constructed and its tight worst-case bound is analyzed. In order to further verify the performance of the proposed heuristics, we develop a lower bound on the optimal objective function. Computational experiments show that the heuristic algorithm performs well on randomly generated problem instances.     

A rule for slack allocation proportional to the duration in a PERT network

In this paper, we define a new rule for the resolution of the slack allocation problem in a PERT network. This problem exists of allocating existing extra time in some paths among the activities belonging to those paths. The allocation rule that we propose assigns extra time to the activities proportionally to their durations in such a way that no path duration exceeds the completion time of the whole project. This time allocation enables us to make a schedule for the PERT project under study. We give two characterizations of the rule and we compare it with others that have been previously defined in the literature.